Classiication of Blind Signature Schemes and Examples of Hidden and Weak Blind Signatures Classiication of Blind Signature Schemes and Examples of Hidden and Weak Blind Signatures
نویسندگان
چکیده
Limited distribution notes: This report has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher its distribution outside the University of Technology Chemnitz-Zwickau prior to publication should be limited to peer communications and speciic requests. After outside publication, requests should be lled only by reprints or legally obtained copies of the article. Abstract We introduce four classes of blind signatures: the hidden, the weak blind, the interactive blind and the strong blind signatures. Then we give examples of hidden ElGamal-signatures and weak blind signature schemes with message recovery which were developed from the ideas of Nyberg and Rueppel's signature scheme.
منابع مشابه
Short blind signatures
Blind signatures allow users to obtain signatures on messages hidden from the signer; moreover, the signer cannot link the resulting message/signature pair to the signing session. This paper presents blind signature schemes, in which the number of interactions between the user and the signer is minimal and whose blind signatures are short. Our schemes are defined over bilinear groups and are pr...
متن کاملHidden Signature Schemes Based on the Discrete Logarithm Problem and Related Concepts Hidden Signature Schemes Based on the Discrete Logarithm Problem and Related Concepts
Limited distribution notes: This report has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher its distribution outside the University of Technology Chemnitz-Zwickau prior to publication should be limited to peer communications and speciic requests. After outside publication, requests should be lled only by rep...
متن کاملDouble voter perceptible blind signature based electronic voting protocol
Mu et al. have proposed an electronic voting protocol and claimed that it protects anonymity of voters, detects double voting and authenticates eligible voters. It has been shown that it does not protect voter's privacy and prevent double voting. After that, several schemes have been presented to fulfill these properties. However, many of them suffer from the same weaknesses. In this p...
متن کاملA Stamped Hidden-signature Scheme Utilizing The Elliptic Curve Discrete Logarithm Problem
Based on the anonymity that digital signatures provide to users and messages, digital signatures can be classified as hidden, weak, interactive, or strong blind signatures. The hidden blind signature hides the signed message from the signer’s vision during his interaction with an honest requester. Later on, after revealing the message the signer can easily link the message-signature pair. The h...
متن کاملEfficient Blind and Partially Blind Signatures Without Random Oracles
This paper proposes a new ecient signature scheme from bilinear maps that is secure in the standard model (i.e., without the random oracle model). Our signature scheme is more eective in many applications (e.g., blind signatures, group signatures, anonymous credentials etc.) than the existing secure signature schemes in the standard model such as the Boneh-Boyen [6], Camenisch-Lysyanskaya [10],...
متن کامل